Algorithms for Reducing Crosstalk in Two-Layer Channel Routing
نویسندگان
چکیده
Crosstalk minimization is one of the most important high performance aspects in interconnecting VLSI circuits. With advancement of fabrication technology, devices and interconnecting wires are placed in closer proximity and circuits operate at higher frequencies. This results in crosstalk between wire segments. Crosstalk minimization problem for the reserved two-layer Manhattan channel routing is NP-hard, even if the channel instances are free from any vertical constraint (simplest channel instances). In this paper we have developed heuristic algorithms for computing reduced crosstalk two-layer channel routing solutions for simplest as well as general channel instances. In general, the results obtained are highly encouraging.
منابع مشابه
Three Layer Routing for Reliability Enhancement
In this paper we study two important reliability issues in deep submicron VLSI design, namely antenna eeect and crosstalk noise, in the context of three-layer channel routing. Cost functions for both of the failure mechanisms are introduced and based on these cost models, reliability enhancement techniques are presented. For antenna eeect minimization, a layer reassignment algorithm is adopted ...
متن کاملCrosstalk Minimization in Three-Layer HVH Channel Routing
Crosstalk has become a major issue in VLSI design due to the high fr equency, long interconnecting lines and small spacing between interconnects in today's integrated circuits. In this paper, we study the problem of crosstalk minimization in 3-layer HVH channel routing. A heuristic algorithm that combines layer reassignment and track reassignment is presented. This algorithm can iteratively mod...
متن کاملA Re-router for Reducing Wire Length in Multi-Layer No-Dogleg Channel Routing
The minimization of total wire length is one of the most key issue in VLSI physical design automation, as it reduces the cost of physical wiring required along with the electrical hazards of having long wires in the interconnection, power consumption, and signal propagation delay. So, it is still important as cost as well as high performance issue. The problem of reduced wire length routing sol...
متن کاملHigh-speed All- Optical Time Division Multiplexed Node
In future high-speed self-routing photonic networks based on all-optical time division multiplexing (OTDM) it is highly desirable to carry out packet switching, clock recovery and demultplexing in the optical domain in order to avoid the bottleneck due to the optoelectronics conversion. In this paper we propose a self-routing OTDM node structure composed of an all-optical router and demultiplex...
متن کاملA Review on Channel Routing On VLSI Physical Design
We know that channel routing is very important problem in VLSI physical design. The main objective of a channel routing algorithm is the reduction of the area of a IC chip. In this paper, we just do a survey on some impotent multi-layer routing algorithms. Here we analyze The Efficient Routing algorithm and resolve horizontal constraints and minimize the net wirelength in a particular model of ...
متن کامل